Practical method for decomposing discretized breakup cross sections into components of each channel

نویسندگان

چکیده

Background: In the continuum-discretized coupled-channel method, a breakup cross section (BUX) is obtained as an admixture of several components different channels in multichannel scattering.Purpose: Our goal to propose approximate way decomposing discretized BUX into each channel. This approximation referred ``probability separation (P separation).''Method: As example, we consider $^{11}\mathrm{Be}$ scattering by using three-body model with core excitation ($^{10}\mathrm{Be}+n+T$, where $T$ target). The structural part constructed particle-rotor and reaction described distorted-wave Born approximation.Results: validity P tested comparing exact calculation. reproduces BUXs well regardless configurations and/or resonance positions $^{11}\mathrm{Be}$.Conclusion: method proposed here can be alternative approach for four- or five-body strict decomposition hard perform.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comprehensive calculations of three–body breakup cross sections

We present in detail a theoretical model for fragmentation reactions of three–body halo nuclei. The different reaction mechanisms corresponding to the different processes are described and discussed. Coulomb and nuclear interactions are simultaneously included and the method is therefore applicable for any target, light, intermediate and heavy. Absolute values of many differential cross section...

متن کامل

Decomposing a Multigraph into Split Components

A linear-time algorithm for decomposing a graph into split components is presented. The algorithm uses a new graph transformation technique to gradually transform the given graph so that every split component in it is transformed into a subgraph with very simple structure which can be easily identified. Once the split components are determined, the triconnected components of the graph are easil...

متن کامل

Decomposing Polygons Into Diameter Bounded Components

A decomposition of a polygon P is a set of polygons whose geometric union is exactly P . We consider the problem of decomposing a polygon, which may contain holes, using subpolygons that have a bounded diameter. We show that this problem is NP-complete via a reduction from Planar 3, 4SAT .

متن کامل

On decomposing speech into modulated components

We model a segment of filtered speech signal as a product of elementary signals as opposed to a sum of sinusoidal signals. Using this model, one can better appreciate the basic relationships between envelopes and phases or instantaneous frequencies (IF’s) of signals. These relationships reveal some interesting properties of the signal’s modulations. For instance, if the contribution due to a si...

متن کامل

Decomposing Boolean formulas into connected components

The aim of this contribution is to find a way how to improve efficiency of current state-of-the-art satisfiability solvers. The idea is to split a given instance of the problem into parts (connected components) which can be solved separately. For this purpose we define component trees and a related problem of finding optimal component trees. We describe how this approach can be combined with st...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review C

سال: 2021

ISSN: ['2470-0002', '2469-9985', '2469-9993']

DOI: https://doi.org/10.1103/physrevc.103.l031601